Knowledge compilation of logic programs using approximation fixpoint theory
نویسندگان
چکیده
منابع مشابه
Knowledge compilation of logic programs using approximation fixpoint theory
Recent advances in knowledge compilation introduced techniques to compile positive logic programs into propositional logic, essentially exploiting the constructive nature of the least fixpoint computation. This approach has several advantages over existing approaches: it maintains logical equivalence, does not require (expensive) loop-breaking preprocessing or the introduction of auxiliary vari...
متن کاملKnowledge Compilation of Logic Programs Using Approximation Fixpoint Theory published in Theory and Practice of Logic Programming BART BOGAERTS and GUY VAN DEN BROECK
Appendix A Figures This appendix contains some figures associated with the gear wheels example (Example 4.13). The first figure contains a circuit representation of the parametrised well-founded model of logic program P w from Example 4.13. turns1(0) turns2(0) turns1(1) turns2(1) Th(Aw) button1(0) button2(0) f f f f f f ∨ ∧ ∧ ¬ ¬ ∨ ∧ ∧ ¬ ¬ f f ∨ ∨ turns1(0) ⇔ turns2(0) ⇔ turns1(1) ⇔ turns2(1) ⇔...
متن کاملThe Differential Fixpoint of General Logic Programs
We present a version of the alternating xpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the well-founded model of logic programs with negation bottom-up without any recomputations. Further extensions of the semantics, e.g. to stable models or disjunctive programs are possible this way. We show how to implement the algorithm eeciently using...
متن کاملA Fixpoint Characterization of Abductive Logic Programs
This is a revised and extended version of the paper [19] which was presented at the Tenth International Conference on Logic Programming, Budapest, June 21{25, 1993. Address correspondence to Katsumi Inoue, Department of Information and Computer Sciences, Toyohashi University of Technology, Tempaku-cho, Toyohashi 441, Japan. E-mail: [email protected] y Chiaki Sakama, Department of Computer ...
متن کاملCompilation of Subset-Logic Programs
Subset logic programming is a paradigm of programming with subset and equality assertions, and whose execution model is based on associativecommutative (a-c) matching and innermost reduction. SEL (Set Equational Language) is a language that has been proposed to illustrate this approach. Th.is thesis describes the design and implementation of a system that compiles SEL programs into an instructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2015
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068415000162